and PrincieAgrawal, “Travelling Salesman Problem using Genetic Algorithm

This paper includes a flexible method for solving the travelling salesman problem using genetic algorithm. In this problem TSP is used as a domain.TSP has long been known to be NP-complete and standard example of such problems. There had been many attempts to address this problem using classical methods such as integer programming and graph theory algorithms with different success. This paper offers a solution which includes a genetic algorithm implementation in order to give a maximal approximation of the problem with the reduction of cost. In genetic algorithm crossover is as a main operator for TSP. There were lot of attempts to discover an appropriate crossover operator. This paper presents a strategy to find the nearly optimized solution to these type of problems, using new crossover technique for genetic algorithm that generates high quality solution to the TSP. The efficiency of the crossover operator is compared as against some existing crossover operators. The work proposed here intends to compare the efficiency of the new crossover operator with some existing crossover operators. 1